Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Conception algorithme")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 154

  • Page / 7
Export

Selection :

  • and

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Identifying periodic occurrences of a template with applications to protein structureFISCHETTI, V. A; LAUDAU, G. M; SELLERS, P. H et al.Information processing letters. 1993, Vol 45, Num 1, pp 11-18, issn 0020-0190Article

Engineering a sort functionBENTLEY, J. L; MCILROY, M. D.Software, practice & experience. 1993, Vol 23, Num 11, pp 1249-1265, issn 0038-0644Article

A distributed voting scheme to maximize preferencesAUER, Peter; CESA-BIANCHI, Nicolo.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 389-403, issn 0988-3754, 15 p.Article

On tuning the Boyer-Moore-Horspool string searching algorithmSMITH, P. D.Software, practice & experience. 1994, Vol 24, Num 4, pp 435-436, issn 0038-0644Article

A faster alternative to SSS* with extension to variable memorySUBIR BHATTACHARYA; BAGCHI, A.Information processing letters. 1993, Vol 47, Num 4, pp 209-214, issn 0020-0190Article

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphsMING-SHING YU; LIN YU TSENG; SHOE-JANE CHANG et al.Information processing letters. 1993, Vol 46, Num 1, pp 7-11, issn 0020-0190Article

A modified greedy heuristic for the Set Covering problem with improved worst case boundGOLDSCHMIDT, O; HOCHBAUM, D. S; GANG YU et al.Information processing letters. 1993, Vol 48, Num 6, pp 305-310, issn 0020-0190Article

A probabilistic algorithm for verifying matrix products using O(n2) time and log2n+O(1) random bitsKIMBREL, T; SINHA, K. R.Information processing letters. 1993, Vol 45, Num 2, pp 107-110, issn 0020-0190Article

Scramjet missile design using genetic algorithmsHARTFIELD, R. J; BURKHALTER, J. E; JENKINS, R. M et al.Applied mathematics and computation. 2006, Vol 174, Num 2, pp 1539-1563, issn 0096-3003, 25 p.Article

LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMSBODIRSKY, Manuel; KRAL, Daniel.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 916-933, issn 0895-4801, 18 p.Article

The longest almost-increasing subsequenceELMASRY, Amr.Information processing letters. 2010, Vol 110, Num 16, pp 655-658, issn 0020-0190, 4 p.Article

The rectilinear steiner arborescence problem is NP-completeWEIPING SHI; CHEN SU.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 729-740, issn 0097-5397, 12 p.Article

An incremental LL(1) parsing algorithmWUU YANG.Information processing letters. 1993, Vol 48, Num 2, pp 67-72, issn 0020-0190Article

Determining uni-connectivity in directed graphsBUCHSBAUM, A. L; CARLISLE, M. C.Information processing letters. 1993, Vol 48, Num 1, pp 9-12, issn 0020-0190Article

Online scheduling with reassignment on two uniform machinesQIAN CAO; ZHAOHUI LIU.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2890-2898, issn 0304-3975, 9 p.Article

Quantum factorization algorithm by NMR ensemble computersCHEN, Chien-Yuan; HSUEH, Chih-Cheng.Applied mathematics and computation. 2006, Vol 174, Num 2, pp 1363-1369, issn 0096-3003, 7 p.Article

Approximation algorithms for some vehicle routing problemsBAZGAN, Cristina; HASSIN, Refael; MONNOT, Jérome et al.Discrete applied mathematics. 2005, Vol 146, Num 1, pp 27-42, issn 0166-218X, 16 p.Article

Limited bookmark randomized online algorithms for the paging problemBEIN, Wolfgang W; REISCHER, Rudolf; LARMORE, Lawrence L et al.Information processing letters. 2000, Vol 76, Num 4-6, pp 155-162, issn 0020-0190Article

An algorithm for approximate membership checking with application to password securityMANBER, U; SUN WU.Information processing letters. 1994, Vol 50, Num 4, pp 191-197, issn 0020-0190Article

An optimal algorithm for selection in a min-heapFREDERICKSON, G. N.Information and computation (Print). 1993, Vol 104, Num 2, pp 197-214, issn 0890-5401Article

A fast and effective heuristic for the feedback arc set problemEADES, P; XUEMIN LIN; SMYTH, W. F et al.Information processing letters. 1993, Vol 47, Num 6, pp 319-323, issn 0020-0190Article

Benchmarking parallel processing platforms: an applications perspectiveMUELLER-THUNS, R. B; SAAB, D. G; DAMIANO, R. F et al.IEEE transactions on parallel and distributed systems. 1993, Vol 4, Num 8, pp 947-954, issn 1045-9219Article

Note on the Homogeneous Set sandwich problemDE FIGUEIREDO, Celina M. H; DE SA, Vinicius G. P.Information processing letters. 2005, Vol 93, Num 2, pp 75-81, issn 0020-0190, 7 p.Article

Optimal parallel algorithms for coloring bounded degree graphs and finding maxiaml independent sets in rooted treesSAJITH, G; SANJEEV SAXENA.Information processing letters. 1994, Vol 49, Num 6, pp 303-308, issn 0020-0190Article

  • Page / 7